A jump to the bell number for hereditary graph properties

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A jump to the bell number for hereditary graph properties

A hereditary graph property is a collection of labeled graphs, closed under isomorphism and also under the taking of induced subgraphs. Its speed is the number of graphs in the property as a function of the number of vertices in the graph. Earlier research has characterized the speeds for hereditary graph properties up to n(1+o(1))n, and described the properties that have those smaller speeds. ...

متن کامل

Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)

A graph property is a set of graphs closed under isomorphism. A property is hereditary if it is closed under taking induced subgraphs. Given a graph property X , we write Xn for the number of graphs in X with vertex set {1, 2, . . . , n} and following [1] we call Xn the speed of the property X . The paper [2] identifies a jump in the speed of hereditary graph properties to the Bell number Bn an...

متن کامل

Some properties and domination number of the complement of a new graph associated to a commutative ring

In this paper some properties of the complement of  a new graph  associated with a commutative ring  are investigated ....

متن کامل

Graph limits and testing hereditary graph properties

We show that an important recent result of Alon and Shapira on testing hereditary graph properties can be derived from the existence of a limit object for convergent graph sequences.

متن کامل

Uniform Number of a Graph

We introduce the notion of uniform number of a graph. The  uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2005

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2005.02.004